A New Accuracy Criterion for Approximate Proximal Point Algorithms
نویسندگان
چکیده
منابع مشابه
Un-regularizing: approximate proximal point algorithms for empirical risk minimization A. Derivation of regularized ERM duality
For completeness, in this section we derive the dual (5) to the problem of computing proximal operator for the ERM objective (3).
متن کاملA New Criterion for Screening Medical Applicants
Introduction. In the current screening system, new admissions are based on general intelligence as measured by universities entrance examination. Considering the fact that an important function of medical graduates is to educate the patients how to restore and take care of their health, communicative competence and skills would be, at least, as important as general intelligence. To show that la...
متن کاملA New Criterion for Normal Form Algorithms
In this paper, we present a new approach for computing normal forms in the quotient algebra A of a polynomial ring R by an ideal I. It is based on a criterion, which gives a necessary and suucient condition for a projection onto a set of polynomials, to be a normal form modulo the ideal I. This criterion does not require any monomial ordering and generalizes the Buchberger criterion of S-polyno...
متن کاملUn-regularizing: approximate proximal point and faster stochastic algorithms for empirical risk minimization
We develop a family of accelerated stochastic algorithms that optimize sums of convex functions. Our algorithms improve upon the fastest running time for empirical risk minimization (ERM), and in particular linear least-squares regression, across a wide range of problem settings. To achieve this, we establish a framework, based on the classical proximal point algorithm, useful for accelerating ...
متن کاملGeneralized Proximal Point Algorithms for Quasiconvex Programming
In this paper, we proposed algorithms interior proximal methods based on entropylike distance for the minimization of the quasiconvex function subjected to nonnegativity constraints. Under the assumptions that the objective function is bounded below and continuously differentiable, we established the well definedness of the sequence generated by the algorithms and obtained two important converg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2001
ISSN: 0022-247X
DOI: 10.1006/jmaa.2001.7535